Multiobjective Multitree model solution using MOEA
نویسندگان
چکیده
In a previous paper a novel Generalized Multiobjective Multitree model (GMM-model) was proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, in this paper a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows.
منابع مشابه
GMM-model for Dynamic Multicast Groups using a probabilistic BFS Algorithm
Generalized Multiobjective Multitree model (GMMmodel) considering by the first time multitree-multicast load balancing with splitting in a multiobjective context. To solve the GMM-model, a multiobjective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) was proposed. In this paper, we extends the GMM-model to dynamic multicast groups (i.e., in which egr...
متن کاملUsing ACO in MOEA/D for Multiobjective Combinatorial Optimization
Combining ant colony optimization (ACO) and multiobjective evolutionary algorithm based on decomposition (MOEA/D), this paper proposes a multiobjective evolutionary algorithm, MOEA/D-ACO. Following other MOEA/D-like algorithms, MOEA/D-ACO decomposes an multiobjective optimization problem into a number of single objective optimization problems. Each ant (i.e. agent) is responsible for solving on...
متن کاملMultiobjective Cloud Particle Optimization Algorithm Based on Decomposition
Abstract: The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has received attention from researchers in recent years. This paper presents a new multiobjective algorithm based on decomposition and the cloud model called multiobjective decomposition evolutionary algorithm based on Cloud Particle Differential Evolution (MOEA/D-CPDE). In the proposed method, the best solution...
متن کاملMultiobjective Combinatorial Optimization by Using Decomposition and Ant Colony
Combining ant colony optimization (ACO) and multiobjective evolutionary algorithm based on decomposition (MOEA/D), this paper proposes a multiobjective evolutionary algorithm, MOEA/D-ACO. Following other MOEA/D-like algorithms, MOEA/D-ACO decomposes a multiobjective optimization problem into a number of single objective optimization problems. Each ant (i.e. agent) is responsible for solving one...
متن کاملA Multiobjective Differential Evolution Based on Decomposition for Multiobjective Optimization with Variable Linkages
Although a number of multiobjective evolutionary algorithms have been proposed over the last two decades, not much effort has been made to deal with variable linkages in multiobjective optimization. Recently, we have suggested a general framework of multiobjective evolutionary algorithms based on decomposition (MOEA/D) [1]. MOEA/D decomposes a MOP into a number of scalar optimization subproblem...
متن کامل